Forchheimer flow to a well-considering time-dependent critical radius

Numerical modeling of Forchheimer flow to a pumping well in a confined aquifer using the strong-form mesh-free method

A numerical analysis of non-Darcian flow to a pumping well in a confined aquifer using the strong-form mesh-free (MFREE) method is described. This technique is targeted at problems that use advanced numerical approaches for modeling non-Darcian flow and it supports the assumption that the non-Darcian flow follows the Forchheimer equation. Interpolation functions including the multi-quadrics (MQ...

Exact solutions for the flow of a generalized second grade due to a Longitudinal quadratic time-dependent shear stress

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

Tunneling out of a time-dependent well

Solutions to explicit time-dependent problems in quantum mechanics are rare. In fact, all known solutions are coupled to specific properties of the Hamiltonian and may be divided into two categories: One class consists of time-dependent Hamiltonians which are not higher than quadratic in the position operator, like i.e. the driven harmonic oscillator with time-dependent frequency. The second cl...

Minimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...